Multiuser Searchable Encryption with Token Freshness Verification

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Searchable Encryption with Keyword-Recoverability

Searchable encryption has many applications including email systems and storage systems. The usefulness of searchable encryption derives from its support of keyword-testability. Keyword-testability means that a receiver of a ciphertext can test whether the ciphertext contains a specific keyword. Recently, Bellare et al. suggested an efficientlysearchable encryption scheme with keyword-recoverab...

متن کامل

Searchable encryption

We built a system supporting encrypted substring search of a text document. The user can encrypt and upload files to a server. The client can also query the server to ask whether an encrypted file contains a particular string of characters. The query, like the file, is not sent in plaintext but is encrypted or hashed. The server should be able to respond correctly to queries without learning th...

متن کامل

Garbled Searchable Symmetric Encryption

In a searchable symmetric encryption (SSE) scheme, a client can keyword search over symmetrically-encrypted files which he stored on the server (ideally without leaking any information to the server). In this paper, we show the first multiple keyword search SSE scheme such that even the search formula f (AND, OR and so on) is kept secret. Our scheme is based on an extended garbled circuit satis...

متن کامل

Multi-Key Searchable Encryption

We construct a searchable encryption scheme that enables keyword search over data encrypted with different keys. The scheme is practical and was designed to be included in a new system for protecting data confidentiality in client-server applications against attacks on the server.

متن کامل

Substring-Searchable Symmetric Encryption

In this paper, we consider a setting where a client wants to outsource storage of a large amount of private data and then perform substring search queries on the data – given a data string s and a search string p, find all occurrences of p as a substring of s. First, we formalize an encryption paradigm that we call queryable encryption, which generalizes searchable symmetric encryption (SSE) an...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Security and Communication Networks

سال: 2017

ISSN: 1939-0114,1939-0122

DOI: 10.1155/2017/6435138